Efficiently determining Convergence in Polynomial Recurrence Sequences
نویسنده
چکیده
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity. The basic idea of our approach is to construct a univariate polynomial equation in x, whose coefficients correspond to the terms of the Sequence. The approach then obtains the condition by analyzing five cases that cover all possible real values of x. The condition can be evaluated within time that is a polynomial function of the size of the description of the Polynomial Recurrence Sequence, hence convergence or nonconvergence can be efficiently determined. There has been a lot of study [1][2][3] into the convergence properties of linear recurrence sequences and polynomial recurrence sequences. Some authors have focussed on whether the value of the N th term of the sequence (not necessary an integer sequence), can asymptotically converge to some real, as N tends to infinity. Other authors have focussed on whether the ratio of the N th term to the (N+1) th term can asymptotically converge to some real, as N tends to infinity. In this paper, we develop an approach to determine whether or not the N th term of a given sequence, can become equal to a given target rational K, as N tends to infinity. The starting points and the coefficients of the sequence, are rationals. The term " rational " denotes a real number (x/y) where both x and y are integers and y≠0. In the rest of this paper, when we say p i " converges to K " , we mean that the value of p N = K, as N tends to infinity. In this paper, by " infinity " we mean " positive infinity ". We also denote the absolute value function of x as abs(x), so abs(x) = x if x ≥ 0, and abs(x) = x if x < 0. Sections 2 and 3 apply our approach to homogeneous linear recurrence sequences and nonhomogeneous linear recurrence sequences, respectively. Section 4 applies our approach to polynomial recurrence sequences 2. Homogeneous Linear Recurrence Sequences Consider a homogeneous linear recurrence sequence as follows: p i = c i , for all integers i in [0,L1] , and p i = p i1 a 1 + p i2 a 2 + …
منابع مشابه
Recursive sequences and polynomial congruences
We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ޚ m [ω] = ޚ m [x]/ f. When m = p is prime, this order can be ...
متن کاملOn Discrete Stochastic Processes Generated by Deterministic Sequences and Multiplication Machines
We consider a discrete stochastic process X = (X 0 ; X 1 ;) with nite state space f0; 1; ; b ? 1g, which carries the random asymptotic behaviour of the relative frequency in which the digits appear in the expansion in base b of a linear recurrent sequence of real numbers. If denotes the dominant root of the characteristic polynomial associated with the linear recurrence relation, by a classical...
متن کاملSharp Estimates for Jacobi Matrices and Chain Sequences
Chain sequences are positive sequences fang of the form an 1⁄4 gnð1 gn 1Þ for a nonnegative sequence fgng: This concept has been introduced by Wall in connection with continued fractions. These sequences are very useful in determining the support of orthogonality measure for orthogonal polynomials. Equivalently, they can be used for localizing spectra of Jacobi matrices associated with orthogon...
متن کامل$mathcal{I}_2$-convergence of double sequences of\ fuzzy numbers
In this paper, we introduce and study the concepts of $mathcal{I}_2$-convergence, $mathcal{I}_2^{*}$-convergence for double sequences of fuzzy real numbers, where $mathcal{I}_2$ denotes the ideal of subsets of $mathbb N times mathbb N$. Also, we study some properties and relations of them.
متن کاملRecurrence Relations for Polynomial Sequences via Riordan Matrices
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1307.2164 شماره
صفحات -
تاریخ انتشار 2013